Avoiding Forbidden Submatrices by Row Deletions

نویسندگان

  • Sebastian Wernicke
  • Jochen Alber
  • Jens Gramm
  • Jiong Guo
  • Rolf Niedermeier
چکیده

We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have entries chosen from a finite-size alphabet), to remove a minimum number of rows such that A has no submatrix which is equivalent to a row or column permutation of B. An application of this question can be found, e.g., in the construction of perfect phylogenies. Establishing a strong connection to variants of the NP-complete Hitting Set problem, we show that for most matrices B Row Deletion(B) is NP-complete. On the positive side, the relation with Hitting Set problems yields constant-factor approximation algorithms and fixed-parameter tractability results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions

We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed “forbidden submatrix” B, the task is to remove a minimum number of rows from A such that no row or column permutation of B occurs as a submatrix in the resulting matrix. An application of this problem can be found, for instance, in the construction of perfect phylogenies. Establishing ...

متن کامل

The Search for Consecutive Ones Submatrices: Faster and More General

Finding for a given 0/1-matrix a maximum-size submatrix that fulfills the Consecutive Ones Property is generally an NP-hard problem. Based on previous work, we present improved approximation and fixed-parameter algorithms for obtaining such submatrices by a minimum number of column deletions. Moreover, we show how to extend these results to the non-symmetrical case where instead of column delet...

متن کامل

Recognizing Balanceable Matrices

A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/ ± 1 matrices and balanceable ...

متن کامل

On Minimum Saturated Matrices

Motivated both by the work of Anstee, Griggs, and Sali on forbidden submatrices and also by the extremal sat-function for graphs, we introduce sat-type problems for matrices. Let F be a family of k-row matrices. A matrix M is called F-admissible if M contains no submatrix F ∈ F (as a row and column permutation of F ). A matrix M without repeated columns is F-saturated if M is F-admissible but t...

متن کامل

On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs

Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a lineartime algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatrices of matrices that do not have the consecutive-ones property. We give a linear-time algorithm to find one in any matrix that does not have the co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004